Simple Proof of the Prime Number Theorem , etc

نویسنده

  • Paul Garrett
چکیده

The point here is the relatively simple argument that non-vanishing of an L-function on the line Re (s) = 1 implies an asymptotic result parallel to the application of ζ(s) to the Prime Number Theorem. This is based upon [Newman 1980]. In particular, this argument avoids estimates on the zeta function at infinity and also avoids Tauberian arguments. For completeness, we recall the standard clever ad hoc argument for the non-vanishing of ζ(s) on Re (s) = 1, thus giving a complete proof of the Prime Number Theorem here. However, the larger intent is to prove non-vanishing results for L-functions by capturing the L-functions in constant terms of Eisenstein series (after Langlands and Shahidi), and then apply the present argument to obtain the most immediate asymptotic corollary. • Non-vanishing of L-functions on Re(s) = 1 • Convergence theorem • First corollary on asymptotics • Elementary lemma on asymptotics • The Prime Number Theorem • Second corollary on asymptotics • A general asymptotic result 1. Non-vanishing of L-functions on Re(s) = 1 As the simplest example, the Riemann zeta function ζ(s) = n 1 n s = p prime 1 1 − 1 p s does not vanish on the line Re(s) = 1. This is not obvious! (The usual simple but ad hoc proof is given just below, for completeness.) As a consequence, using the Euler product expansion over primes, its logarithmic derivative d ds log ζ(s) = ζ (s) ζ(s) = − p d ds log(1 − p −s) = − p log p p s − p m≥2 log p p ms is holomorphic (except for the pole at s = 1) on an open set containing Re (s) ≥ 1. From this we prove (below) the Prime Number Theorem lim x→∞ number of primes ≤ x x/ log x = 1 or, at it is usually written, π(x) ∼ x log x As is well known, a form of this was conjectured by Gauss, and the theorem was proven independently by Hadamard and by de la Valleé Poussin. The methodology below is perhaps the clearest proof of the Prime Number Theorem, using simplifications found by D.J. Newman about 1980. However, the simplified form does not give any indication of the relation between zero-free regions and the error term in the Prime Number Theorem. In general, non-vanishing of an L-function (with Euler product) on a vertical line implies …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2-quasirecognizability of the simple groups B_n(p) and C_n(p) by prime graph

Let G be a finite group and let $GK(G)$ be the prime graph of G. We assume that $n$ is an odd number. In this paper, we show that if $GK(G)=GK(B_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then G has a unique nonabelian composition factor isomorphic to $B_n(p)$ or $C_n(p)$ . As consequences of our result, $B_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the ...

متن کامل

New characterization of some linear ‎groups‎

‎There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...

متن کامل

On Tychonoff's type theorem via grills

‎Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces‎, ‎and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$‎. ‎We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ ‎related to these grills, and present a simple proof to this theorem‎. ‎This immediately yields the classical theorem...

متن کامل

عدد تناوبی گراف‌ها

In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem. 

متن کامل

Second Order Moment Asymptotic Expansions for a Randomly Stopped and Standardized Sum

This paper establishes the first four moment expansions to the order o(a^−1) of S_{t_{a}}^{prime }/sqrt{t_{a}}, where S_{n}^{prime }=sum_{i=1}^{n}Y_{i} is a simple random walk with E(Yi) = 0, and ta is a stopping time given by t_{a}=inf left{ ngeq 1:n+S_{n}+zeta _{n}>aright}‎ where S_{n}=sum_{i=1}^{n}X_{i} is another simple random walk with E(Xi) = 0, and {zeta _{n},ngeq 1} is a sequence of ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005